Decomposition of Quadratic Variational Problems
نویسندگان
چکیده
Variational problems have proved of value in many image processing and analysis applications. However increase of sensor resolution as occurred in medical imaging and experimental fluid dynamics demand for adapted solving strategies to handle the huge amount of data. In this paper we address the decomposition of the general class of quadratic variational problems, which includes several important problems, such as motion estimation and image denoising. The basic strategy is to subdivide the originally intractable problem into a set of smaller convex quadratic problems. Particular care is taken to avoid ill-conditioned sub-problems. We demonstrate the approach by means of two relevant variational problems.
منابع مشابه
Domain Decomposition Methods for Variational Inequalities
Variational inequalities have found many applications in applied science. A partial list includes obstacles problems, fluid flow in porous media, management science, traffic network, and financial equilibrium problems. However, solving variational inequalities remain a challenging task as they are often subject to some set of complex constraints, for example the obstacle problem. Domain decompo...
متن کاملProjector preconditioning for partially bound-constrained quadratic optimization
Preconditioning by a conjugate projector is combined with the recently proposed MPRGP algorithm for the solution of bound constrained quadratic programming problems. If applied to the partially bound constrained problems, such as those arising from the application of FETI based domain decomposition methods to the discretized elliptic boundary variational inequalities, the resulting algorithm is...
متن کاملSolution of Coercive and Semicoercive Contact Problems by FETI Domain Decomposition
A new Neumann-Neumann type domain decomposition algorithm for the solution of contact problems of elasticity and similar problems is described. The discretized variational inequality that models the equilibrium of a system of elastic bodies in contact is first turned by duality to a strictly convex quadratic programming problem with either box constraints or box and equality constraints. This s...
متن کاملPreconditioning for Bound Constrained Quadratic Programming Problems Arising from Discretization of Variational Inequalities
The active set based MPRGP (modified proportioning with reduced gradient projection) [1] for the solution of partially bound constrained quadratic programming problems turned out to be an important ingredient in development of scalable algorithms for the solution of variational inequalities by FETI [3] and BETI [4] domain decomposition methods. The algorithm was proved to have R-linear rate of ...
متن کاملFurther Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming
A classical method for solving the variational inequality problem is the projection algorithm. We show that existing convergence results for this algorithm follow from one given by Gabay for a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Moreover, we extend the projection algorithm to solve any monotone affine variational inequality problem. When applied ...
متن کامل